Orthogonal range searching in linear and almost-linear space
نویسندگان
چکیده
منابع مشابه
Lecture Notes: Range Searching with Linear Space
In this lecture, we will continue our discussion on the range searching problem. Recall that the input set P consists of N points in R. Given an axis-parallel rectangle q, a range query reports all the points of P ∩ q. We want to maintain a fully dynamic structure on P to answer range queries efficiently. We will focus on non-replicating structures [2, 3]. Specifically, consider that each point...
متن کاملAlmost multiplicative linear functionals and approximate spectrum
We define a new type of spectrum, called δ-approximate spectrum, of an element a in a complex unital Banach algebra A and show that the δ-approximate spectrum σ_δ (a) of a is compact. The relation between the δ-approximate spectrum and the usual spectrum is investigated. Also an analogue of the classical Gleason-Kahane-Zelazko theorem is established: For each ε>0, there is δ>0 such that if ϕ is...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولExploring the Problem Space of Orthogonal Range Searching
Orthogonal range searching is a fundamental problem in computational geometry: preprocess a set of points into a data structure such that we can efficiently answer questions about the points that lie in axis-aligned rectangles called query ranges. There are many interesting variants of orthogonal range searching with differing complexities. We consider classic fundamental variants, new variants...
متن کاملGRADUAL NORMED LINEAR SPACE
In this paper, the gradual real numbers are considered and the notion of the gradual normed linear space is given. Also some topological properties of such spaces are studied, and it is shown that the gradual normed linear space is a locally convex space, in classical sense. So the results in locally convex spaces can be translated in gradual normed linear spaces. Finally, we give an examp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2009
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2008.09.001